NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
941	1 EGRES Quick-Proof No[removed]Finding edge-disjoint subgraphs in graphs Attila Bern´ath? and Zolt´an Kir´aly Add to Reading List Source URL: www.cs.elte.hu Language: English - Date: 2010-04-12 06:05:14 Spanning tree NP-complete problems One-in-three 3SAT Tree Theoretical computer science Mathematics Computational complexity theory
942	Bipancyclic Properties of Faulty Hypercubes Add to Reading List Source URL: downloads.hindawi.com Language: English - Date: 2014-08-28 19:13:12 NP-complete problems Hypercube graph Hamiltonian path Graph Tree Graph theory Theoretical computer science Mathematics
943	10 TH IEEE I NTERNATIONAL C ONFERERNCE ON C OMPUTER V ISION (ICCV 2005), O CTOBER 17–20, 2005, B EIJING , C HINA . Finding Tree Structures by Grouping Symmetries Hiroshi Ishikawa† [removed] † Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2008-01-16 15:03:23 NP-complete problems Combinatorial optimization Spanning tree Steiner tree problem Graph Tree Connectivity Shortest path problem Matching Graph theory Mathematics Theoretical computer science
944	Artificial Intelligence Artificial Intelligence Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2009-03-06 00:35:16 NP-complete problems Complexity classes Operations research Combinatorial optimization Travelling salesman problem Optimization problem NP Branch and bound Mathematical optimization Theoretical computer science Computational complexity theory Applied mathematics
945	Puzzle Corner Dog Puzzle Albert is a keen dog admirer and over the years has had a number of dogs. He has had an Alsatian, a Dalmatian, a Poodle and a Great Dane, but not necessarily in that order. Albert had Add to Reading List Source URL: nopr.niscair.res.in Language: English - Date: 2012-09-19 06:49:17 Logic puzzles Problem solving Puzzle Dalmatian Sudoku Mathematics NP-complete problems Games
946	Approximation Algorithms for Stochastic Orienteering Anupam Gupta∗ Ravishankar Krishnaswamy† Viswanath Nagarajan‡ Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-09-30 21:07:28 Combinatorial optimization NP-complete problems Operations research Cryptography Knapsack problem Approximation algorithm Linear programming relaxation SL Matching Theoretical computer science Computational complexity theory Applied mathematics
947	Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades Add to Reading List Source URL: kups.ub.uni-koeln.de Language: English - Date: 2011-03-28 06:57:24 NP-complete problems Logic in computer science Complexity classes Boolean algebra 2-satisfiability Boolean satisfiability problem Conjunctive normal form Outerplanar graph Planar graph Theoretical computer science Graph theory Computational complexity theory
948	Sudoku For Kids brought to you by www.makingmathmorefun.com Copyright © 2008 Teresa Evans. Add to Reading List Source URL: www.am.dodea.edu Language: English - Date: 2010-02-09 22:20:02 NP-complete problems Sudoku Fraction FO Multiplication Sudoku algorithms Mathematics of Sudoku Mathematics Elementary arithmetic Recreational mathematics
949	Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication Add to Reading List Source URL: www.econ.brown.edu Language: English - Date: 2013-06-19 07:39:31 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory NP-complete NP-hard P versus NP problem NP Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
950	An E cient Mean Field Annealing Formulation for Mapping Unstructured? Domains to Hypercubes Cevdet Aykanat and I_smail Haritaoglu Computer Engineering Department, Bilkent University, Ankara, Turkey [removed] Add to Reading List Source URL: www.cs.bilkent.edu.tr Language: English - Date: 2006-07-06 10:53:25 NP-complete problems Cubes Hypercube Parallel computing Shortest path problem Heuristic Graph partition Algorithm Mathematics Theoretical computer science Computational complexity theory

UPDATE